NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
691	The Complexity of Degree Anonymization by Vertex Addition Robert Bredereck? , Vincent Froese?? , Sepp Hartung, Andr´e Nichterlein, Rolf Niedermeier, and Nimrod Talmon? ? ? Institut f¨ ur Softwaretechnik und Theoretisch Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-04-17 07:44:41 NP-complete problems Degree Tree Independent set Clique Connectivity Vertex Graph Neighbourhood Graph theory Theoretical computer science Mathematics
692	To appear in the Intl. J. of Robotics Research Also Technical Report CRES, Center for Robotics and Embedded Systems, USC, July 2003 A formal analysis and taxonomy of task allocation in multi-robot systems Brian P. Add to Reading List Source URL: cres.usc.edu Language: English - Date: 2004-06-08 10:49:29 Operations research Linear programming Combinatorial optimization NP-complete problems Greedy algorithm Robot Assignment problem Algorithm Set cover problem Mathematics Theoretical computer science Applied mathematics
693	The Power of Local Search: Maximum Coverage over a Matroid Yuval Filmus1,2 and Justin Ward1 1 2 Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2011-12-02 06:14:39 NP-complete problems Matroid theory Operations research Submodular set function Matroid Greedy algorithm Set cover problem Linear programming Algorithm Mathematics Theoretical computer science Applied mathematics
694	Artificial Intelligence–120 www.elsevier.com/locate/artint Compiling problem specifications into SAT ✩ Marco Cadoli a,∗ , Andrea Schaerf b a Dipartimento di Informatica e Sistemistica, Università di Add to Reading List Source URL: www.diegm.uniud.it Language: English - Date: 2008-12-11 12:42:15 Complexity classes NP-complete problems Mathematical optimization Logic in computer science Boolean satisfiability problem Electronic design automation NP-complete 2-satisfiability NP Theoretical computer science Computational complexity theory Applied mathematics
695	Logic Puzzles booklet #11 ©Tim Peeters (http://www.home.zonnet.nl/kostunix/) Dear puzzle(d) friends, This is already my 11th booklet with logic puzzles made especially for all you puzzlers in the world. This 1 Add to Reading List Source URL: www.home.zonnet.nl Language: English - Date: 2003-10-24 04:09:57 Games Human behavior Logic puzzles Publishing Puzzle video games NP-complete problems Leisure Crossword
696	Logic Puzzles booklet #8 ©2002 Tim Peeters (http://www.home.zonnet.nl/kostunix/) Battle Ships #1 (-) On all the maps 6 ships are floating around. The numbers in the sideline tell you how many parts of ships are hidd Add to Reading List Source URL: www.home.zonnet.nl Language: English* - Date: 2002-05-13 20:44:53 Logic puzzles NP-complete problems Nonogram
697	Logic Puzzles booklet #10 ©Tim Peeters (http://www.home.zonnet.nl/kostunix/) Number Crossword (***) The numbers tell you the sum of the digits you ought to fill in. Every sum has to be reached by an additio Add to Reading List Source URL: www.home.zonnet.nl Language: English - Date: 2003-06-19 06:31:31** NP-complete problems Crossword Logic puzzles
698	On Explaining Integer Vectors by Few Homogenous Segments Robert Bredereck? , Jiehua Chen?? , Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, and Ondˇrej Such´ y? ? ? Institut f¨ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-05-07 04:32:27 Abstract algebra Linear algebra NP-complete problems Computational complexity theory Vectors Parameterized complexity Kernelization FO Parameter Algebra Mathematics Theoretical computer science
699	A 2.5 Factor Approximation Algorithm for the k-MST Problem Sunil Arya∗ H. Ramesh† Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2006-04-04 10:31:23 NP-complete problems Spanning tree Network theory Minimum spanning tree Shortest path problem Tree Graph Approximation algorithm Steiner tree problem Theoretical computer science Graph theory Mathematics
700	Saturn: A SAT-based Tool for Bug Detection? Yichen Xie and Alex Aiken Computer Science Department Stanford University {yxie,aiken}cs.stanford.edu Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2005-05-20 18:05:46 Formal methods Electronic design automation Logic in computer science NP-complete problems Model checking Data types Boolean satisfiability problem Ada Pointer Computing Software engineering Theoretical computer science

UPDATE